Virasoro constraint for Nekrasov instanton partition function
نویسندگان
چکیده
منابع مشابه
Ω-Background and the Nekrasov Partition Function
In this talk we’ll aim to make sense of the Nekrasov partition function (as introduced in Nekrasov’s ICM address [Nek03]) as the partition function in a twisted deformed N = 2 gauge theory. While making the deformation is unnecessary – without it we’re just talking about the partition function in Donaldson-Witten theory – deforming the theory eliminates IR divergences, allowing a direct mathema...
متن کاملVirasoro constraints for Kontsevich-Hurwitz partition function
In [1, 2] M.Kazarian and S.Lando found a 1-parametric interpolation between Kontsevich and Hurwitz partition functions, which entirely lies within the space of KP τ -functions. In [3] V.Bouchard and M.Marino suggested that this interpolation satisfies some deformed Virasoro constraints. However, they described the constraints in a somewhat sophisticated form of AMM-Eynard equations [4, 5, 6, 7]...
متن کاملD-instanton partition functions
Duality arguments are used to determine D-instanton contributions to certain effective interaction terms of type II supergravity theories in various dimensions. This leads to exact expressions for the partition functions of the finite N D-instanton matrix model in d = 4 and 6 dimensions that generalize our previous expression for the case d = 10. These results are consistent with the fact that ...
متن کاملAn elliptic Virasoro symmetry in 6d
We define an elliptic deformation of the Virasoro algebra. We conjecture that the [Formula: see text] Nekrasov partition function reproduces the chiral blocks of this algebra. We support this proposal by showing that at special points in the moduli space the 6d Nekrasov partition function reduces to the partition function of a 4d vortex theory supported on [Formula: see text], which is in turn ...
متن کاملPartition search for non-binary constraint satisfaction
Previous algorithms for unrestricted constraint satisfaction use reduction search, which inferentially removes values from domains in order to prune the backtrack search tree. This paper introduces partition search, which uses an efficient join mechanism instead of removing values from domains. Analytical prediction of quantitative performance of partition search appears to be intractable and e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2012
ISSN: 1029-8479
DOI: 10.1007/jhep10(2012)097